منابع مشابه
Computational Complexity of Functions
Below is a translation from my Russian paper. I added references, unavailable to me in Moscow. Similar results have been also given in [Schnorr Stumpf 75] (see also [Lynch 75]). Earlier relevant work (classical theorems like Compression, Speed-up, etc.) was done in [Tseitin 56, Rabin 59, Hartmanis Stearns 65, Blum 67, Trakhtenbrot 67, Meyer Fischer 72]. I translated only the part with the state...
متن کاملComputational Complexity of Higher Type Functions
The customary identification of feasible with polytime is discussed, Next, higher type functions are presented as a way of giving computational meaning to theorems. In particular, if a theorem has a "feasibly constructive" proof, the associated functions should be polytime. However examples are given to illustrate the difficulty of capturing the notion of polytime for higher type functions. Fin...
متن کاملComputational Complexity of Solving Real Algebraic Formulae
where e e IR", b e IR" and A is an m x n matrix. In the last four years there has been a vast amount of work on "interior point" algorithms, motivated by Karmarkar's algorithm [16]. Unlike the traditional simplex method which moves from vertex to vertex around the feasible region {x;>4x > b}, interior point methods proceed through the interior {x;Ax > b] of the feasible region. Karmarkar's algo...
متن کاملFunctions on Groups and Computational Complexity
We give some connections between various functions defined on finitely presented groups (isoperimetric, isodiametric, Todd-Coxeter radius, filling length functions, etc.), and we study the relation between those functions and the computational complexity of the word problem (deterministic time, nondeterministic time, symmetric space). We show that the isoperimetric function can always be linear...
متن کاملThe Complexity of Real Recursive Functions
We explore recursion theory on the reals, the analog counterpart of recursive function theory. In recursion theory on the reals, the discrete operations of standard recursion theory are replaced by operations on continuous functions, such as composition and various forms of differential equations. We define classes of real recursive functions, in a manner similar to the classical approach in re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1982
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(82)80003-0